Gradual distributed real-coded genetic algorithms
نویسندگان
چکیده
منابع مشابه
Gradual Distributed Real - Coded Genetic Algorithms 1
Genetic algorithm behavior is determined by the exploration/exploitation balance kept throughout the run. When this balance is disproportionate, the premature convergence problem will probably appear, causing a drop in the genetic algorithm's eecacy. One approach presented for dealing with this problem is the distributed genetic algorithm model. Its basic idea is to keep, in parallel, several s...
متن کاملGradual distributed real-coded genetic algorithms
A major problem in the use of genetic algorithms is premature convergence, a premature stagnation of the search caused by the lack of diversity in the population. One approach for dealing with this problem is the distributed genetic algorithm model. Its basic idea is to keep, in parallel, several subpopulations that are processed by genetic algorithms, with each one being independent of the oth...
متن کاملTwo Efficient Real-coded Genetic Algorithms for Real Parameter Optimization
This paper presents an efficient generation alternation model for real-coded genetic algorithm called rc-CGA. The most important characteristic of the proposed rcCGA model is the implicit self-adaptive feature in its crossover and mutation mechanism. By applying two crossover operators (BLX-α and UNDX crossover) in conjunction with Non-Uniform mutation to rc-CGA, respectively, we define two new...
متن کاملReal-Coded Memetic Algorithms
This paper presents a real-coded memetic algorithm that combines a high diversity global exploration with an adaptive local search method to the most promising individuals that adjusts the local search probability and the local search depth. In our proposal we use the individual fitness to decide when local search will be applied (local search probability) and how many effort should be applied ...
متن کاملA Directed Mutation Operator for Real Coded Genetic Algorithms
Developing directed mutation methods has been an interesting research topic to improve the performance of genetic algorithms (GAs) for function optimization. This paper introduces a directed mutation (DM) operator for GAs to explore promising areas in the search space. In this DM method, the statistics information regarding the fitness and distribution of individuals over intervals of each dime...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Evolutionary Computation
سال: 2000
ISSN: 1089-778X
DOI: 10.1109/4235.843494